Symmetrical Covers, Decompositions and Factorisations of Graphs
نویسندگان
چکیده
This paper introduces three new types of combinatorial structures associated with group actions, namely symmetrical covers, symmetrical decompositions, and symmetrical factorisations of graphs. These structures are related to and generalise various combinatorial objects, such as 2-designs, regular maps, near-polygonal graphs, and linear spaces.
منابع مشابه
Uncoverings on graphs and network reliability
We propose a network protocol similar to the k-tree protocol of Itai and Rodeh [Inform. and Comput. 79 (1988), 43–59]. To do this, we define a t-uncovering-by-bases for a connected graph G to be a collection U of spanning trees for G such that any t-subset of edges of G is disjoint from at least one tree in U , where t is some integer strictly less than the edge connectivity of G. We construct ...
متن کاملProduct constructions for transitive decompositions of graphs
A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...
متن کاملEven cycle decompositions of 4-regular graphs and line graphs
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...
متن کاملSwitching in One-Factorisations of Complete Graphs
We define two types of switchings between one-factorisations of complete graphs, called factor-switching and vertex-switching. For each switching operation and for each n 6 12, we build a switching graph that records the transformations between isomorphism classes of one-factorisations of Kn. We establish various parameters of our switching graphs, including order, size, degree sequence, clique...
متن کاملHomogeneous factorisations of complete multipartite graphs
A homogeneous factorisation of a graph is a partition of its arc set such that there exist vertex transitive subgroups M < G 6 Aut(Γ) with M fixing each part of the partition setwise and G preserving the partition and transitively permuting the parts. In this paper we study homogeneous factorisations of complete multipartite graphs such that M acts regularly on vertices. We provide a necessary ...
متن کامل